TIN Surface and Radial Viewshed Determination Algorithm Parallelisation on Multiple Computing Machines
نویسندگان
چکیده
In this paper we have proposed a method of solving the computer graphic problem creating Triangulated Irregular Network (TIN) surface in large clouds order to create viewsheds. The is based on radial TIN and viewshed visualization task subdivision using multiple computing machines, which intended accelerate process generating complete viewshed.
منابع مشابه
Parallelisation of surface-related multiple elimination
This paper presents the first parallelisation of the surface-related multiple elimination method. This method is used in the seismic industry to eliminate multiple data from recorded seismic data. Both data-parallel and control-parallel implementation schemes are investigated. A realisation of the data-parallel implementation on the SSP/Application, a symmetric multi-processor DEC-Alpha system ...
متن کاملComputing Polynomial Segmentation through Radial Surface Representation
The Visual Information Retrieval (VIR) area requires robust implementations achieved trough mathematical representations for images or data sets. The implementation of a mathematical modeling goes from the corpus image selection, an appropriate descriptor method, a segmentation approach and the similarity metric implementation whose are treated as VIR elements. The goal of this research is to f...
متن کاملA Parallel Algorithm for Viewshed Computation on Grid Terrains
Viewshed (or visibility map) computation is an important component in many GIScience applications and, as nowadays there are huge volume of terrain data available at high resolutions, it is important to develop efficient algorithms to process these data. Since the main improvements on modern processors come from multi-core architectures, parallel programming provides a promising means for devel...
متن کاملGAPS: Genetic Algorithm Optimised Parallelisation
The compilation of FORTRAN programs for SPMD execution on parallel architectures often requires the application of program restructuring transformations such as loop interchange, loop distribution, loop fusion, loop skewing and statement reordering. Determining the optimal transformation sequence that minimises execution time for a given program is an NP-complete problem. The hypothesis of the ...
متن کاملA Fast Algorithm for Approximate Viewshed Computation
Given a terrain model, the viewshed from a viewpoint is computed as the set of X-Y positions of a point target such that the target is visible. We introduce a novel approach to the computation of accurate viewshed approximations. Our algorithm relies on the computation of an approximation to the so-called line-of-sight (LOS) function. This function is defined over target X-Y positions, and is t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Symmetry
سال: 2021
ISSN: ['0865-4824', '2226-1877']
DOI: https://doi.org/10.3390/sym13030424